منابع مشابه
Covering a Simple Polygon by Monotone Directions
In this paper we study the problem of finding a set of k directions for a given simple polygon P , such that for each point p ∈ P there is at least one direction in which the line through p intersects the polygon only once. For k = 1, this is the classical problem of finding directions in which the polygon is monotone, and all such directions can be found in linear time for a simple n-gon. For ...
متن کاملPacking and Covering a Polygon with Geodesic Disks
Given a polygon P , for two points s and t contained in the polygon, their geodesic distance is the length of the shortest st-path within P . A geodesic disk of radius r centered at a point v ∈ P is the set of points in P whose geodesic distance to v is at most r. We present a polynomial time 2-approximation algorithm for finding a densest geodesic unit disk packing in P . Allowing arbitrary ra...
متن کاملCovering and coloring polygon-circle graphs
Polygon-circle graphs are intersection graphs of polygons inscribed in a circle. This class of graphs includes circle graphs (intersection graphs of chords of a circle), circular arc graphs (intersection graphs of arcs on a circle), chordal graphs and outerplanar graphs. We investigate binding functions for chromatic number and clique covering number of polygon-circle graphs in terms of their c...
متن کاملCovering points by disjoint boxes with outliers
For a set of n points in the plane, we consider the axis–aligned (p, k)-Box Covering problem: Find p axis-aligned, pairwise-disjoint boxes that together contain at least n − k points. In this paper, we consider the boxes to be either squares or rectangles, and we want to minimize the area of the largest box. For general p we show that the problem is NP-hard for both squares and rectangles. For ...
متن کاملCovering moving points with anchored disks
Consider a set of mobile clients represented by n points in the plane moving at constant speed along n different straight lines. We study the problem of covering all mobile clients using a set of k disks centered at k fixed centers. Each disk exists only at one instant and while it does, covers any client within its coverage radius. The task is to select an activation time and a radius for each...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2008
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2007.05.001